Collapsible graphs and reductions of line graphs

A graph G is collapsible if for every even subset X ~ V(G), G has a subgraph r such that G E(J ') is connected and the set of odd-degree vertices of J' is X. A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G. In this paper. we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between the line graph of the reduction and the reduction of the line graph. Our results extend fonner results in IH.-j. Lai, Reduced graph of diameter two,j. Graph Theory 14 (1) (1990) 77-87], and in [PA. Catlin, lqblunnisa, T.N.janakiraman, N. S.;nivasan, Hamilton cycles and closed trails in iterated line graphs, j. Graph Theory 14 (1990) 347-364].